Gradient- and Sensitivity-Enhanced TOCSY Experiments

A pulsed field gradient version of the sensitivity-enhanced 2D TOCSY experiment is proposed which yields high-quality spectra with improved sensitivity and a minimum of two scans pert₁increment. For rapid acquisition of 1D TOCSY spectra, the 1D DPFGSE–TOCSY experiment was modified to include phase-encoded multiple-selective excitation followed by a simple spectral editing. Combination of these two building blocks is used in a sensitivity-enhanced 2D analog of the 3D TOCSY–TOCSY experiment which provides an efficient tool for resolving severely overlapped signals of oligomers in short experimental time.     

Synthesis and characterization of functional gradient copolymers of allyl methacrylate and butyl acrylate

Functional spontaneous gradient copolymers of allyl methacrylate (A) and butyl acrylate (B) were synthesized via atom transfer radical polymerization. The copolymerization reactions were carried out in toluene solutions at 100 °C with methyl 2‐bromopropionate as the initiator and copper bromide with N,N,N′,N″,N″‐pentamethyldiethylenetriamine as the catalyst system. Different aspects of the statistical reaction copolymerizations, such as the kinetic behavior, crosslinking density, and gel fraction, were studied. The gel data were compared with Flory's gelation theory, and the sol fractions of the synthesized copolymers were characterized by size exclusion chromatography and nuclear magnetic resonance spectroscopy. The copolymer composition, demonstrating the gradient character of the copolymers, and the microstructure were analyzed. The experimental data agreed well with data calculated with the Mayo–Lewis terminal model and Bernoullian statistics, with monomer reactivity ratios of 2.58 ± 0.37 and 0.51 ± 0.05 for A and B, respectively, an isotacticity parameter for A of 0.24, and a coisotacticity parameter of 0.33. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 5304–5315, 2006     

A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem

In this paper we address a two-dimensional (2D) orthogonal packing problem, where a fixed set of small rectangles has to be placed on a larger stock rectangle in such a way that the amount of trim loss is minimized. The algorithm we propose hybridizes a placement procedure with a genetic algorithm based on random keys. The approach is tested on a set of instances taken from the literature and compared with other approaches. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm.     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.     

Tree-edges deletion problems with bounded diameter obstruction sets

We study the following problem: given a tree G and a finite set of trees H, find a subset O of the edges of G such that G-O does not contain a subtree isomorphic to a tree from H, and O has minimum cardinality. We give sharp boundaries on the tractability of this problem: the problem is polynomial when all the trees in H have diameter at most 5, while it is NP-hard when all the trees in H have diameter at most 6. We also show that the problem is polynomial when every tree in H has at most one vertex with degree more than 2, while it is NP-hard when the trees in H can have two such vertices.The polynomial-time algorithms use a variation of a known technique for solving graph problems. While the standard technique is based on defining an equivalence relation on graphs, we define a quasiorder. This new variation might be useful for giving more efficient algorithm for other graph problems.     

Fast computation of a rational point of a variety over a finite field

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time-space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.

     

桥随路降法治理桥头跳车

分析软土地基上路堤与桥梁的沉降差异及跳车的原因,采用桥随路降的治理方法,应用柱式升降桥墩来调控桥面高程,使桥面降落高度与路面沉降量一致,保持道路竖曲线顺畅,消除桥头跳车.     

关于正定可对称化线性代数方程组的预对称正则化算法

1引言考虑线性代数方程组A_x=b,A∈R~(n×n)非奇异,x,b∈R~n(1)的求解．当系数矩阵是大型稀疏的正定可对称化矩阵,文[1,2]讨论了一类预对称共轭梯度算法(LRSCG算法是其中之一),这类算法的实质是利用非对称的系数矩阵可对称化的性质,并结合共轭梯度法而构造的一种预处理的共轭梯度法[12,16,17]．但非对称的系数     

1．5GHz锯材超导腔的研制

介绍铌材超导腔的研制进展，重点讨论了国产铌腔的材料改性，以及相应的超导腔性能的改进．叙述了１．５ＧＨｚ铌腔的腔形设计，分析了铌材的射频性能和机械性能，制定了铌腔制作与后处理的特定工艺．最后给出了１．５ＧＨｚ铌材超导腔的低温实验结果．     

Hereditary optimal control problems: Numerical method based upon a padé approximation

In this paper, we consider a particular approximation scheme which can be used to solve hereditary optimal control problems. These problems are characterized by variables with a time-delayed argumentx(t – ). In our approximation scheme, we first replace the variable with an augmented statey(t) x(t - ). The two-sided Laplace transform ofy(t) is a product of the Laplace transform ofx(t) and an exponential factor. This factor is approximated by a first-order Padé approximation, and a differential relation fory(t) can be found. The transformed problem, without any time-delayed argument, can then be solved using a gradient algorithm in the usual way. Four problems are solved to illustrate the validity and usefulness of this technique.This research was supported in part by the National Aeronautics and Space Administration under NASA Grant NCC-2-106.